Vertices of Schubitopes
نویسندگان
چکیده
منابع مشابه
Forbidden Vertices
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X . This problem is closely related to finding the k-best basic solutions to a linear problem. We show that the complexity of the problem changes significantly depending o...
متن کاملVertices of Plane Curves
PROOF. Apply Theorem J for the case w==r. We obtain for gr an expression which differs from the one just written only in the fact that the terms Brtr+ifr+i+Brtr+2fr+2+ • • • +Br,nfn are missing from its numerator. But the coefficients J3r,, = 0 when r<s. Hence the two expressions are equal. REMARK. The generalization of the method to orthonormalization with respect to a general norming or weigh...
متن کاملMORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES
The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Several classes of graphs are known that satisfy the condition E(G) > n , where n is the number of vertices. We now show that the same property holds for (i) biregular graphs of degree a b , with q quadrangles, if q<= abn/4 and 5<=a < b = 0 (iii) triregular graphs of degree 1, a, b that are quadran...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملVertices of Gelfand-Tsetlin Polytopes
This paper is a study of the polyhedral geometry of Gelfand–Tsetlin polytopes arising in the representation theory of glnC and algebraic combinatorics. We present a combinatorial characterization of the vertices and a method to calculate the dimension of the lowest-dimensional face containing a given Gelfand–Tsetlin pattern. As an application, we disprove a conjecture of Berenstein and Kirillov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2020.105311